Reachability Analysis of Hybrid Systems via Predicate Abstraction
نویسندگان
چکیده
Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinitestate discrete programs. This paper presents algorithms and tools for reachability analysis of hybrid systems by combining the notion of predicate abstraction with recent techniques for approximating the set of reachable states of linear systems using polyhedra. Given a hybrid system and a set of user-defined boolean predicates, we consider the finite discrete quotient whose states correspond to all possible truth assignments to the input predicates. The tool performs an on-the-fly exploration of the abstract system. We demonstrate the feasibility of the proposed technique by analyzing a parametric timing-based mutual exclusion protocol and safety of a simple controller for vehicle coordination. Comments From the 6th International Workshop, HSCC 2003 Prague, Czech Republic, April 3–5, 2003. This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/202 ! #"$ % &' (*)+ , ./ 0% 12&3 (4 5 6 7 8 , -&3 9 3 : ;=A@ @ B C DFEHG IHJLKMANQZ[B?<OS,\ ] ^ _ ] `La bdc e[fAg a h?f3i jlk-i g bnmTfAaoe c hnp:qrhTjsi eAg c fAtuivhQwTx tua hyx a z9hyt|{vaoeA}[t~fr!i j aohnhn}Tu{ c hnt|c f[fAbM v 335 }[a c } mnba hyhM a pTm TyeAt|pn d v eAa pytux c fAa+c y}f[ec xofAtuivh c }!a g aoeA a pfAi a+c%bi -aoe[jsmyfAa x y hytF?myaRjsi e=aoOf[ec xofAtuhy!nhnt~fAa }fc fAaRg iOpya u}9jFeAivgtuhynhnt~fAa }fc fAa6pytu}[xoeAaofAa6byeAi ec g } V t|}bdc baoeLbTeAa }[a h?fA}9c uvi eAt~f g }Lc hnpQfAi?ivu}ji eLeAa c x c yt|ut~frc hdc ~ }[tu}=i j TyeAt|p}T}fAa g }5?+x ivgRntuhntuhy!f a6hni fAtuivh i j byeAa pytux c fAa c n}f[ec xofAtuivh 't~f eAaox a h?f5fAa x hnt|?mnao}9jsi e6c bnbTeAi Ttug c fAtuhy!f a6}[aof=i j eAa c x c nua }fc fAa }=i j utuhna c e3}T}fAa g }mn}[tuhn=bi u a pTecOT¡9tu{¢a h c yTeAt|p6}T}fAa g£c hdp c5}[aof-i jHmn}[aoe pTaodhya p i?i ua c h bTeAa pytux c fAa } ¤ a x i hn}[t|pya¥ef a-nhnt~fAa pTt|}[x¥eAaofAa'?mni fAtua h?f iv}[a }fc fAa }Rxoi e[eAa }[bi hdpYfAi+c ulbiv}[}[tunua f[eAmyf c }[}[tuvhng aohOfA}5fAiQf a t|hybnmTf=byeAa pTt x c fAa } a-fAi?i Obaoe[jsi eAg }c h ivh f a §¦ 9aoTbnui ec fAt|i h6i jnf a-c y}f[ec xof}T}fAa gQ ̈Ya9pTa g ivhy}f[ec fAa'f a'jsa c }[t|ytu|t~f© i jHf a byeAivbi }[a p fAa x hnt|?mna'? c hdc ~Ta tuhnRc bnc ec g a¥f[eAt|x,fAtug t|hy dc }[a pLg6mTfAmdc vaoTx umn}[tui hRbTeAi fAi?x i yc hdp5}Ac jaofr=i jdc'}[tug bnua x i h?f[eAivuuaoeji e{¢a t|xo|a9x i?i epTt|hnc fAtuivhH « ¬n ® ̄V°5±R2 3 ́®VμA° Z[SH¶· ^ Go@ W1 ̧do1⁄4»¥KV@ ¶¥E ] ] @ ¶o¶ NT1⁄253⁄4¿NW@ D ] KV@ ] Àd^ SVU ^ SÁKH<TGoWÂL<OGo@BT@ G ^FÃM] <?» ^ NTS1<OSMW1·VG¥NT»¥NTÄ ] NTDl<OSH<TDFo¶ ^ ¶ Å ÆVI Ç¢ÈvÉI»oKV@ Go@ KH<y¶5 ̧M@ @ S ^ S ] Go@ <y¶ ^ SVUQGo@ ¶¥@ <OG ] KYNTS4W@ BT@ DNT· ^ SVU¿»o@ ] KVS ^sÊ EV@ ¶ 1⁄2§NTGR<TE»¥Ny3⁄4<?»¥@vWYBT@ G ^FÃM] <O» ^ NTS NO1⁄23Kdod ̧VG ^ W1˧3⁄4 ^FÌ @vW4W ^ ¶ ] G¥@ »¥@ Ä ] NTSn» ^ SdEVNTEH¶ Í3⁄4QNdWV@ Ds¶=NO1⁄23@ 3⁄4:Ä ̧M@vWVW@ W ] NTSn»oG¥NyDFD@ G ¶ Å|ÇyI¥ÎVI ÇvÏ¢ÉÐMJLKH@!¶A» <?»o@ ÄNO1⁄2ÑÄr»¥KV@ Ä<TG» ] Ny3⁄4Q·VE»o<O» ^ NTSH<TD»¥NdNyD¶L1⁄2§NyG 3⁄4QNW@ D ] KV@ ] Àd^ SVU NO1⁄2LKnod ̧VG ^ WÒ¶¥o¶A»o@ 3⁄4¶ <TG¥@QNO1⁄29»AÂ9N Àd^ SHWV¶ ÐlJlNdNTDs¶ ¶E ] KÁ<y¶ ÓÔ ́ÕlÖ,Õ-× Å|ÇyÇ ÉIlØ¿ÙdÚ Ù¢ÛÛ,ÜÒÅ ÝTÞ?ÉI<OSHWÒß àlá âMãMäåÅ|Çvæ?É D ^ 3⁄4 ^ » »oKV@ ] NTSn» ^ SdEVNTEM¶RWodSH<T3⁄4 ^] ¶ »oN%¶ ^ 3⁄4Q·VD@<O ̧H¶»¥G < ] Ä » ^ NTSH¶+¶¥E ] Kç<T¶QGo@ ] »o<TSVUTEVDs<OG ^ S ] DFEH¶ ^ NTSH¶ Ëè@TÐ UHÐ é êìë ÅFÇTíoÝ?ÉÑÍ I <OSMW ] NT3⁄4Q·VE»o@ »¥KV@1⁄4¶@ »+NO1⁄2 G¥@v< ] KH<T ̧VDF@Q¶»o<?»o@ ¶ @ Ì < ] »oDFoÒ<OSHW1⁄4@ î @ ] » ^ BT@ DFo1⁄4 ̧noÒ¶od3⁄4: ̧MNyD ^s] 3⁄4<OS ^ ·VEVDs<?» ^ NySÒNT1⁄29D ^ SV@ <TG ^ SÄ @ Ê EH<OD ^ » ^ @ ¶ ÐïRS»oKV@ NT»¥KV@ GKM<OSHWIn@ 3⁄4Q@ G¥U ^ SVU »¥NdNTDs¶¶¥E ] K <y¶5ðRäâMãMñ-ò=Ûóâ1⁄4ŠȢÉrIdôVõyôyöYÅ Ï?ÉrI <OSHW D@ By@ DFĶ¥@ » ¶53⁄4Q@ »¥KHNdW÷Å|Ç øHI¥ÝVÇ ÉIH<O·V·HG¥N Ì^ 3⁄4Q<O»¥@ »oKV@!¶¥@ » NT1⁄2 Go@ < ] KH<O ̧HDF@ ¶»o<O»¥@ ¶ ̧do · ́NTDoyÄ KV@ WG <RNTG3@ DD ^ ·H¶¥N ^ WV¶LÅFÇ ù?ÉV ̧do Ny·» ^ 3⁄4 ^Fú <?» ^ NTS:»¥@ ] KVS ^sÊ EV@ ¶ ÐOû'By@ S »oKVNTEHUTK:»¥KV@v¶@L»oNnNyD¶-KH<¢By@
منابع مشابه
Progress on Reachability Analysis of Hybrid Systems Using Predicate Abstraction
Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinitestate systems, and has been recently shown to enhance the effectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the verifier performs an on-the-fly search of the finite discrete quotient who...
متن کاملReachability Analysis of Hybrid Systems using Counter-Example Guided Predicate Abstraction∗
Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state discrete programs. This report presents algorithms and tools for reachability analysis of hybrid systems by combining the notion of counter-example guided predicate abstraction with recent techniques for approximating the set of reachable states of linear systems using polyhedra. ...
متن کاملTowards the Safety Verification of Real-Time Systems with the Coq Proof Assistant
Hybrid systems are systems involving the interaction of discrete and continuous dynamics. Hybrid systems have been used as a mathematical model for many safety critical applications. One of the most important analysis problems of hybrid systems is the reachability problem. Approaches based on predicate abstraction are widely used for the reachability analysis. They are not efficient enough beca...
متن کاملModeling and Analysis of Hybrid Systems
MODELING AND ANALYSIS OF HYBRID SYSTEMS Franjo Ivančić Professor Rajeev Alur This thesis discusses the modeling and analysis of hybrid systems. Hybrid modeling is an appropriate modeling framework for embedded systems and other real-world applications bridging the gap between continuous dynamical systems and discrete event systems. First, this thesis presents the hybrid systems modeling languag...
متن کاملReachability Analysis of Delta-NotchLateral Inhibition Using Predicate Abstraction
This paper examines the feasibility of predicate abstraction as a method for the reachability analysis of hybrid systems. A hybrid system can be abstracted into a purely discrete system by mapping the continuous state space into an equivalent finite discrete state space using a finite set of Boolean predicates and a decision procedure in the theory of real closed fields. It is then possible to ...
متن کاملVerification of Component-Based Systems via Predicate Abstraction and Simultaneous Set Reduction
This paper presents a novel safety property verification approach for component-based systems modelled in BIP (Behaviour, Interaction and Priority), encompassing multiparty synchronisation with data transfer and priority. Our contributions consist of: (1) an on-the-fly lazy predicate abstraction technique for BIP; (2) a novel explicit state reduction technique, called simultaneous set reduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002